Finite Vertex Bi-Primitive 2-Arc Transitive Graphs Admitting a Two-Dimensional Linear Group
نویسندگان
چکیده
منابع مشابه
Finite vertex primitive 2-arc regular graphs
A classification is given of finite graphs that are vertex primitive and 2arc regular. The classification involves various new constructions of interesting 2-arc transitive graphs.
متن کاملFinite vertex-primitive and vertex-biprimitive 2-path-transitive graphs
This paper presents a classification of vertex-primitive and vertex-biprimitive 2-path-transitive graphs which are not 2-arc-transitive. The classification leads to constructions of new examples of half-arc-transitive graphs.
متن کاملA Family of Non-quasiprimitive Graphs Admitting a Quasiprimitive 2-arc Transitive Group Action
Let 0 be a simple graph and let G be a group of automorphisms of 0. The graph is (G, 2)-arc transitive if G is transitive on the set of the 2-arcs of 0. In this paper we construct a new family of (PSU(3, q2), 2)-arc transitive graphs 0 of valency 9 such that Aut0 = Z3.G, for some almost simple group G with socle PSU(3, q2). This gives a new infinite family of non-quasiprimitive almost simple gr...
متن کاملThe vertex primitive and vertex bi-primitive s-arc regular graphs
A complete classification is given of vertex primitive and vertex bi-primitive s-arc regular graphs with s ≥ 3. In particular, it is shown that the Petersen graph and Coxeter graph are the only vertex primitive 3-arc regular graphs, and that vertex bi-primitive 3-arc regular graphs consist of the complete bipartite graph K3,3, the standard double covers of the Petersen graph and Coxeter graph, ...
متن کاملThe locally 2-arc transitive graphs admitting an almost simple group of Suzuki type
A graph Γ is said to be locally (G, 2)-arc transitive for G a subgroup of Aut(Γ) if, for any vertex α of Γ, G is transitive on the 2-arcs of Γ starting at α. In this talk, we will discuss general results involving locally (G, 2)-arc transitive graphs and recent progress toward the classification of the locally (G, 2)-arc transitive graphs, where Sz(q) ≤ G ≤ Aut(Sz(q)), q = 2 for some k ∈ N. In ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2907321